Finding Composition Factors of Permutation Groups of Degree n < 10^6
نویسنده
چکیده
Given a subgroup G = (F) of S n specified in terms of a generating set F, when n < 106 we present algorithms to test the simplicity of G, to find all of its composition factors, and to find a composition series. While there are already existing algorithms for these purposes (due to Luks or Neumann) valid for all n, the ones in the present note are designed to replace many group theoretic computations by arithmetic calculations using properties of n and 1GI.
منابع مشابه
Calculations of Dihedral Groups Using Circular Indexation
In this work, a regular polygon with $n$ sides is described by a periodic (circular) sequence with period $n$. Each element of the sequence represents a vertex of the polygon. Each symmetry of the polygon is the rotation of the polygon around the center-point and/or flipping around a symmetry axis. Here each symmetry is considered as a system that takes an input circular sequence and g...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملBases for Primitive Permutation Groups and a Conjecture of Babai
A base of a permutation group G is a sequence B of points from the permutation domain such that only the identity of G fixes B pointwise. We show that primitive permutation groups with no alternating composition factors of degree greater than d and no classical composition factors of rank greater than d have a base of size bounded above by a function of d. This confirms a conjecture of Babai. Q...
متن کاملOn The Orders of Primitive Groups
Almost all primitive permutation groups of degree n have order at most n · Q[log2 n]−1 i=0 (n − 2) < n2 , or have socle isomorphic to a direct power of some alternating group. The Mathieu groups, M11, M12, M23 and M24 are the four exceptions. As a corollary the sharp version of a theorem of Praeger and Saxl is established, where M12 turns out to be the ”largest” primitive group. For an applicat...
متن کاملGroups with Two Extreme Character Degrees and their Minimal Faithful Representations
for a finite group G, we denote by p(G) the minimal degree of faithful permutation representations of G, and denote by c(G), the minimal degree of faithful representation of G by quasi-permutation matrices over the complex field C. In this paper we will assume that, G is a p-group of exponent p and class 2, where p is prime and cd(G) = {1, |G : Z(G)|^1/2}. Then we will s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 12 شماره
صفحات -
تاریخ انتشار 1991